ftp.cs.arizona.edu/ftp.cs.arizona.edu.tar/ftp.cs.arizona.edu/icon/newsgrp/group93b.txt/000103_icon-group-sender _Fri May 14 16:29:56 1993.msg

Internet Message Format | 1993-06-16 | 2KB

Received: from owl.CS.Arizona.EDU by cheltenham.cs.arizona.edu; Tue, 18 May 1993 09:47:18 MST
Received: by owl.cs.arizona.edu; Tue, 18 May 1993 09:47:17 MST
Date: 14 May 93 16:29:56 GMT
From: amethyst!organpipe.uug.arizona.edu![e-mail]  (Dave Schaumann)
Organization: University of Arizona
Subject: Re: Icon vs Prolog, docs, availability ?
Message-Id: <[e-mail]>
References: <borbor-130593120939@129.194.82.105>, <[e-mail]>, <[e-mail]>
Sender: [e-mail]
To: [e-mail]
Status: R
Errors-To: [e-mail]

In article <[e-mail]>, goer@ellis (Richard L. Goerwitz) writes:
>[e-mail] (Dave Schaumann) writes:
>
>>  Select a in (size of list) and i in L[a].  The loop terminates when
>>  L[a] is empty for all a.
>>
>>This can be expressed very nicely in Icon as
>>
>>  while a := 1 to *L & i := !L[a] do {
>>    # do the loop stuff
>>    }
>
>I might tend to write the loop stuff as applying to every !!L,
>which produces every element of every element of L, unless the
>code involved actual shortening of L and/or L's elements.

Actually, the loop *has* to shorten L (since I'm using while and
not every).  I could change to every and use your method, except
that the contents of L changes during each iteration.

It's also important to the algorithm to know which list "i" is
taken from (ie, it needs to have the value of "a")

--
Dave Schaumann            [e-mail]